Note on strong refutation algorithms for random k-SAT formulas
نویسندگان
چکیده
We present a simple strong refutation algorithm for random k-SAT formulas. Our algorithm applies to random k-SAT formulas on n variables with ω(n)n(k+1)/2 clauses for any ω(n) → ∞. In contrast to the earlier results of Coja-Oghlan, Goerdt, and Lanka (for k = 3, 4) and Coja-Oghlan, Cooper, and Frieze (for k ≥ 5), which address the same problem for even sparser formulas our algorithm is more elementary.
منابع مشابه
On the Combinatorics of SAT and the Complexity of Planar Problems
In this thesis we study several problems arising in Boolean satisfiability ranging from lower bounds for SAT algorithms and proof systems to extremal properties of formulas. The first problem is about construction of hard instances for k-SAT algorithms. For PPSZ algorithm [40] we give the first construction of k-CNF instances that require running time at least 2(1− k)n, where k = O(log2 k/k). F...
متن کاملStrong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is at most 1−2−k+o(1) as m/n →∞ almost surely. In this paper, we deal with the corresponding algorithmic strong refutation problem: given a random k-SAT formula, can we find a certificate that the fraction of satisfiable clauses is at most 1 −...
متن کاملRandom Θ(log n)-CNFs Are Hard for Cutting Planes
The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics and is a benchmark for satisfiability algorithms. We show that when k = Θ(log n), any Cutting Planes refutation for random k-SAT requires exponential size in the interesting regime where the number of clauses guarantees that the formula is unsatisfiable...
متن کاملRandom CNFs are Hard for Cutting Planes
The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiablity algorithms, and lastly average-case hardness over this distribution has also been linked to hardness of approximation via Feige’s hypothesis. In this paper, we prove that any Cutting Planes refutation for ran...
متن کاملTheoretical Foundations of Applied SAT Solving ( 14 w 5101 ) January 19 - 24 , 2014 MEALS
Speaker: Albert Atserias (Universitat Politecnica de Catalunya) Title: Mini-tutorial on semialgebraic proof systems Abstract: A variety of semialgebraic proof systems, i.e. those operating with polynomial inequalities over the reals, were defined in the last two decades to reason about optimality or near optimality in combinatorial optimization problems. In this mini-tutorial we overview their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 35 شماره
صفحات -
تاریخ انتشار 2009